On-Line Edge-Coloring with a Fixed Number of Colors y
نویسنده
چکیده
منابع مشابه
Topology coloring
The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in differe...
متن کاملAnalysis of approximate algorithms for constrainedand unconstrained edge - coloring of bipartite
The problem of edge-coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors. An optimal algorithm uses the minimum number of colors to color the edges. We consider several approximation algorithms for edge-coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case. We also brie y consider the constrained edge-colori...
متن کاملA new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملAnalysis of Approximate Algorithms for Constrained and Unconstrained Edge-coloring of Bipartite Graphs Applied Research Bellcore
The problem of edge coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors An optimal algorithm uses the minimum number of colors to color the edges We consider several approximation algorithms for edge coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case We also brie y consider the constrained edge coloring ...
متن کاملWhen the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence
The 3-consecutive vertex coloring number ψ3c(G) of a graph G is the maximum number of colors permitted in a coloring of the vertices of G such that the middle vertex of any path P3 ⊂ G has the same color as one of the ends of that P3. This coloring constraint exactly means that no P3 subgraph of G is properly colored in the classical sense. The 3-consecutive edge coloring number ψ′ 3c(G) is the...
متن کامل